RLC Clock Tree Construction Based on DME Algorithms Associated with Grey Relational Cluster

In this paper, we associate grey relational clustering with DME approach, called GDME, for solving the problem of clock tree construction. The experimental results show that our GDME improves up to 3.58% on total average in terms of total wire length than that of other DME algorithms. Additionally, our results of zero-skew RLC-based clock trees compared with Hspice are lower to 0.017% and 0.2% on absolutely average in terms of skew and delay, respectively. The results demonstrate that our proposed algorithm can get a RCor RLC-based clock tree with zero skew and minimal delay for all the testing cases and benchmarks. IndexTerms— Clock tree, Zero skew, Grey relational cluster, DME (Deferred-Merge Embedding).